package pl.edu.agh.student.janikhankus.earley;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.TreeSet;

/**
 * Each OrderedDict class member holds Earley's situations set for every run.
 * Number of runs is eaual to size of tokens (parsing word size).
 * 
 * @author tom
 * 
 */
public class OrderedDict {
	Map<ParseProduction, TreeSet<Precedents>> d;
	/**
	 * 
	 */
	List<ParseProduction> l;

	public OrderedDict() {
		d = new HashMap<ParseProduction, TreeSet<Precedents>>();
		l = new ArrayList<ParseProduction>();
	}
}
